Revisiting the Parallel Strategy for DOACROSS Loops

Journal of Computer Science and Technology - DOACROSS loops are significant parts in many important scientific and engineering applications, which are generally exploited pipeline/wave-front...     

Study on maximum power point tracking of photovoltaic array in irregular shadow

Traditional maximum power point tracking (MPPT) methods can hardly find global maximum power point (MPP) because output characteristics curve of photovoltaic (PV) array may have multi local maximum power points in irregular shadow, and thus easily fall into the local maximum power point. To address this drawback, Considering that sliding mode variable structure (SMVS) control strategy have such advantages as simple structure, fast response and strong robustness, and P&O method have the advantages of simple principle and convenient implementation, so a new algorithm combining SMVS control method and P&O method is proposed, besides, PI controller is applied to reduce system chattering caused by switching sliding surface. It is applied to MPPT control of PV array in irregular shadow to solve the problem of multi-peak optimization in partial shadow. In order to verity the rationality of the proposed algorithm, the experimental circuit is built, which achieves MPPT control by means of the proposed algorithm and P&O method. The experimental results show that compared with the traditional P&O algorithm, the proposed algorithm can fast track the global MPP, tracking speed increases by 60% and the relative error decreased by 20%. Moreover, the system becomes more stable near the MPP, the fluctuations of output power is greatly reduced, and thus make full use of solar energy.     

The aditi deductive database system

Deductive databases generalize relational databases by providing support for recursive views and non-atomic data. Aditi is a deductive system based on the client-server model; it is inherently multi-user and capable of exploiting parallelism on shared-memory multiprocessors. The back-end uses relational technology for efficiency in the management of disk-based data and uses optimization algorithms especially developed for the bottom-up evaluation of logical queries involving recursion. The front-end interacts with the user in a logical language that has more expressive power than relational query languages. We present the structure of Aditi, discuss its components in some detail, and present performance figures.     

Granularity Analysis for Exploiting Adaptive Parallelism of Declarative Programs on Multiprocessors

1IntroductionAutomaticparallelexecutionofdeclarativelanguageprograms(e.g.functionprogramsandlogicprograms)isattractive,asitmakestheuseofparallelcomputersveryeasy,andtheprogrammerneednotbeconcernedwiththespecificsoftheunderlyingparallelarchitecture.However,ifseveralprocessorsareexecutingconcurrently,exploitingadaptiveparallelismishardduetonon-determinismoftaskgranularityanddatadependenciesamongtasks.TheearlysolutionproposedbyConeryandKibler[2]usesanorderingalgorithmtodeterminedependenciesatrun…     

激光干涉环圆心位置测定技术及应用

本文利用在平面内绕定轴旋转的线阵ＣＣＤ及微机系统自动测定激光干涉环圆心位置及应用于激光外径千分尺平行度检查仪平行度检查结果的自动数字化输出。     

EIGENVECTORS-BASED PARALLELISATION OF NESTED LOOPS WITH AFFINE DEPENDENCES

Abstract

This paper presents a method for parallelising nested loops with affine dependences. The data dependences of a program are represented exactly using a dependence matrix rather than an imprecise dependence abstraction. By a careful analysis of the eigenvectors and eigenvalues of the dependence matrix, we detect the parallelism inherent in the program, partition the iteration space of the program into sequential and parallel regions, and generate parallel code to execute these regions. For a class of programs considered in the paper, the proposed method can expose more coarse-grain and fine-grain parallelism than a hyperplane-based loop transformation.     

Some efficient solutions to the affine scheduling problem. Part II. Multidimensional time

This paper extends the algorithms which were developed in Part I to cases in which there is no affine schedule, i.e. to problems whose parallel complexity is polynomial but not linear. The natural generalization is to multidimensional schedules with lexicographic ordering as temporal succession. Multidimensional affine schedules, are, in a sense, equivalent to polynomial schedules, and are much easier to handle automatically. Furthermore, there is a strong connection between multidimensional schedules and loop nests, which allows one to prove that a static control program always has a multidimensional schedule. Roughly, a larger dimension indicates less parallelism. In the algorithm which is presented here, this dimension is computed dynamically, and is just sufficient for scheduling the source program. The algorithm lends itself to a divide and conquer strategy. The paper gives some experimental evidence for the applicability, performances and limitations of the algorithm.     

基于Visual Basic 开发机床主传动非常规变速系统的设计--重复转速的传动系统(实例之二)

本文介绍利用Visual Basic工具开发金属切削机床主传动非常规变速系统的设计总体结构，功能和方法，以重复转速的传动系统为例，重点介绍转速图的拟定过程，本系统具有界面美观，操作方便，易于理解的特点。